Distributed Generalized Nash Equilibrium Seeking for Energy Sharing Games in Prosumers
نویسندگان
چکیده
With the proliferation of distributed generators and energy storage systems, traditional passive consumers in power systems have been gradually evolving into so-called “prosumers,” i.e., proactive consumers, which can both produce consume power. To encourage exchange among prosumers, sharing is increasingly adopted, usually formulated as a generalized Nash game (GNG). In this paper, approach proposed to seek Generalized equilibrium (GNE) game. end, we first prove strong monotonicity Then, GNG converted an equivalent optimization problem. An algorithm based on Nesterov's methods thereby devised solve problem consequently find GNE manner. The convergence proved rigorously nonexpansive operator theory. performance validated by experiments with three scalability tested simulations using 1888 prosumers.
منابع مشابه
A Distributed Nash Equilibrium Seeking in Networked Graphical Games
This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player’s cost function may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the asymmetric information requirements. For a given interference graph, network communication betwe...
متن کاملA Douglas-Rachford splitting for semi-decentralized generalized Nash equilibrium seeking in Monotone Aggregative Games
We address the generalized Nash equilibrium seeking problem for noncooperative agents playing non-strictly monotone aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized Nash equilibria of the game as the zeros of a monotone setvalued operator. Then, we massage the Douglas–Rachford splitting to solve the monotone inclusion problem and ...
متن کاملStochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
We introduce a multi-input stochastic extremum seeking algorithm to solve the problem of seeking Nash equilibria for a noncooperative game whose N players seek to maximize their individual payoff functions. The payoff functions are general (not necessarily quadratic), and their forms are not known to the players. Our algorithm is a nonmodel-based approach for asymptotic attainment of the Nash e...
متن کاملNash equilibrium and generalized integration for infinite normal form games
Infinite normal form games that are mathematically simple have been treated [ Harris, C.J., Stinchcombe, M.B., Zame, W.R., in press. Nearly compact and continuous normal form games: characterizations and equilibrium existence. Games Econ. Behav.]. Under study in this paper are the other infinite normal form games, a class that includes the normal forms of most extensive form games with infinite...
متن کاملDistributed Nash equilibrium seeking: A gossip-based algorithm
This paper presents an asynchronous gossip-based algorithm for finding aNash equilibrium (NE) of a game in a distributedmulti-player network. The algorithm is designed in such away that playersmake decisions based on estimates of the other players’ actions obtained from local neighbors. Using a set of standard assumptions on the cost functions and communication graph, the paper proves almost su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2021
ISSN: ['0885-8950', '1558-0679']
DOI: https://doi.org/10.1109/tpwrs.2021.3058675